Polynomial C1 shape functions on the triangle

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The doubloon polynomial triangle

The doubloon polynomials are generating functions for a class of combinatorial objects called normalized doubloons by the compressed major index. They provide a refinement of the q-tangent numbers and also involve two major specializations: the Poupard triangle and the Catalan triangle.

متن کامل

On the psychophysics of the shape triangle

We earlier introduced an approach to categorical shape description based on the singularities (shocks) of curve evolution equations. We now consider the simplest compositions of shocks, and show that they lead to three classes of parametrically ordered shape sequences, organized along the sides of a shape triangle. By conducting several psychophysical experiments we demonstrate that shock-based...

متن کامل

Alternating Sums in the Hosoya Polynomial Triangle

The Hosoya polynomial triangle is a triangular arrangement of polynomials where each entry is a product of two polynomials. The geometry of this triangle is a good 1 tool to study the algebraic properties of polynomial products. In particular, we find closed formulas for the alternating sum of products of polynomials such as Fibonacci polynomials, Chebyshev polynomials, Morgan-Voyce polynomials...

متن کامل

On the metric triangle inequality

A non-contradictible axiomatic theory is constructed under the local reversibility of the metric triangle inequality. The obtained notion includes the metric spaces as particular cases and the generated metric topology is T$_{1}$-separated and generally, non-Hausdorff.

متن کامل

The Polynomial Functions on Frobenius Complements

We determine the number of unary polynomial functions on all Frobenius complements and on all finite solvable groups all of whose abelian subgroups are cyclic. 1. Notation and results Let (G, ·) be a group. A unary polynomial function p : G → G is a function that can be written in the form p(x) := a0x a1x e1 · · · an−1xan, where n ∈ N0, a0, . . . , an are in G, and e0, . . . , en−1 are integers...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Structures

سال: 2013

ISSN: 0045-7949

DOI: 10.1016/j.compstruc.2012.07.003